On the Benefits of a Domain-specific Language for Modeling Metaheuristic Optimization Algorithms
نویسندگان
چکیده
This work provides a case-study of how metaheuristic optimization algorithms can be developed using a domain-specific language as a separate modeling layer. A separation of the modeling process from the implementation of the algorithmic concepts improves the communication and collaboration of practitioners, optimization experts and programmers. This is achieved by providing a higher level of abstraction compared to a general-purpose programming language. A generic and extensible modeling concept is presented and several example algorithm models are illustrated.
منابع مشابه
A hybrid method to improve Steganography in JPEG images using metaheuristic algorithms
This paper presents a method for improving steganography and enhancing the security using combinatorial Meta-heuristic algorithms. The goal is to achieve an improved PSNR value in order to preserve the image quality in the steganography process. Steganography algorithms, in order to insert message signal information inside the host data, create small changes based on the message signal in the ...
متن کاملSTRUCTURAL RELIABILITY ASSESSMENT UTILIZING FOUR METAHEURISTIC ALGORITHMS
The failure probability of the structures is one of the challenging problems in structural engineering. To obtain the reliability index introduced by Hasofer and Lind, one needs to solve a nonlinear equality constrained optimization problem. In this study, four of the most recent metaheuristic algorithms are utilized for finding the design point and the failure probability of problems with cont...
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملA Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
متن کاملEFFICIENCY OF IMPROVED HARMONY SEARCH ALGORITHM FOR SOLVING ENGINEERING OPTIMIZATION PROBLEMS
Many optimization techniques have been proposed since the inception of engineering optimization in 1960s. Traditional mathematical modeling-based approaches are incompetent to solve the engineering optimization problems, as these problems have complex system that involves large number of design variables as well as equality or inequality constraints. In order to overcome the various difficultie...
متن کامل